Distributed from The Derivation of Termination Detection Algorithms Garbage Collection Schemes
نویسندگان
چکیده
A b s t r a c t . It is shown that the termination detection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the termination detection problem are obtained by applying trausformations to garbage collection algorithms. The transformation can be applied to collectors of the "mark-and-sweep" type as well as to reference counting garbage collectors. As an example, the scheme is used to transform the weighted reference counting protocol.
منابع مشابه
The Derivation of a New DMOS Distributed Garbage Collector
This talk describes the derivation of a modularised version of the DMOS distributed garbage collection algorithm. DMOS appears to exhibit a unique combination of attractive characteristics for a distributed garbage collector but the original algorithm is known to contain a bug and, previous to this work, lacks a satisfactory, understandable implementation. A modularised DMOS algorithm is develo...
متن کاملImplementing a Family of Distributed Garbage Collectors
This paper discusses implementations of distributed garbage collectors derived using a previously developed methodology which involves mappings of distributed termination detection algorithms (DTAs) to local garbage collection schemes. Implementations produced by such mappings preserve the safety and completeness properties of the original local collectors. Through our collector implementations...
متن کاملStarting with Termination: A Methodology for Building Distributed Garbage Collection Algorithms
We propose an effective methodology in which a distributed garbage collector may be derived from a distributed termination algorithm and a centralized garbage collector in a manner that preserves interesting properties of the original collector, such as completeness. To illustrate our technique we show how two distributed termination algorithms, credit recovery and task balancing, may be suitab...
متن کاملEmpirical Studies of Distributed Garbage Collection
Garbage collection has been a necessary evil of computer languages that employ dynamic data structures. The 1990’s has seen some significant technology shifts that present new challenges for automatic garbage collection. In particular, distributed systems are providing an economical approach to parallel processing. Many distributed garbage collection algorithms have been proposed but few have b...
متن کاملDistributed Termination Detection with Sticky State Indicators
Distributed termination detection is a \prototype problem" of the theory of distributed computing which has gained considerable interest in recent years. It is closely related to other important problems such as deadlock detection [CMH83, Na86], garbage collection [TTL88, TM90], and snapshot computation [CL85, Ma90]. The main purpose of this short note is not to introduce yet another distribute...
متن کامل